منابع مشابه
Simple heuristics for unit disk graphs
Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP-hard optimization problems on unit disk graphs. The problems considered include maximum independent set, minimum vertex cover, minimum coloring and minimum dominating set. We also present an on-line coloring heuristic which achieves a compe...
متن کاملGeometry based heuristics for unit disk graphs
Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP-hard optimization problems on unit disk graphs. The problems considered include maximum independent set, minimum vertex cover, minimum coloring and minimum dominating set. We also present an on-line coloring heuristic which achieves a compe...
متن کاملApproximation Algorithms for Unit Disk Graphs
Mobile ad hoc networks are frequently modeled by unit disk graphs. We consider several classical graph theoretic problems on unit disk graphs (Maximum Independent Set, Minimum Vertex Cover, and Minimum (Connected) Dominating Set), which are relevant to such networks. We propose two new notions for unit disk graphs: thickness and density. The thickness of a graph is the number of disk centers in...
متن کاملDynamic Connectivity for Unit Disk Graphs ∗
Let S ⊂ R be a set of point sites. The unit disk graph UD(S) of S has vertex set S and an edge between two sites s, t if and only if |st| ≤ 1. We present a data structure that maintains the connected components of UD(S) when S changes dynamically. It takes O(log n) time to insert or delete a site in S and O(log n/ log log n) time to determine if two sites are in the same connected component. He...
متن کاملPlanar Hop Spanners for Unit Disk Graphs
The simplest model of a wireless network graph is the Unit Disk Graph (UDG): an edge exists in UDG if the Euclidean distance between its endpoints is ≤ 1. The problem of constructing planar spanners of Unit Disk Graphs with respect to the Euclidean distance has received considerable attention from researchers in computational geometry and ad-hoc wireless networks. In this paper, we present an a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 1995
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.3230250205